Covering matroid
نویسندگان
چکیده
In this paper, we propose a new type of matroids, namely covering matroids, and investigate the connections with the second type of covering-based rough sets and some existing special matroids. Firstly, as an extension of partitions, coverings are more natural combinatorial objects and can sometimes be more efficient to deal with problems in the real world. Through extending partitions to coverings, we propose a new type of matroids called covering matroids and prove them to be an extension of partition matroids. Secondly, since some researchers have successfully applied partition matroids to classical rough sets, we study the relationships between covering matroids and covering-based rough sets which are an extension of classical rough sets. Thirdly, in matroid theory, there are many special matroids, such as transversal matroids, partition matroids, 2-circuit matroid and partition-circuit matroids. The relationships among several special matroids and covering matroids are studied.
منابع مشابه
Relationship between the second type of covering-based rough set and matroid via closure operator
Recently, in order to broad the application and theoretical areas of rough sets and matroids, some authors have combined them from many different viewpoints, such as circuits, rank function, spanning sets and so on. In this paper, we connect the second type of covering-based rough sets and matroids from the view of closure operators. On one hand, we establish a closure system through the fixed ...
متن کاملMatroid intersection, base packing and base covering for infinite matroids
As part of the recent developments in infinite matroid theory, there have been a number of conjectures about how standard theorems of finite matroid theory might extend to the infinite setting. These include base packing, base covering, and matroid intersection and union. We show that several of these conjectures are equivalent, so that each gives a perspective on the same central problem of in...
متن کاملConnectedness of graphs and its application to connected matroids through covering-based rough sets
Graph theoretical ideas are highly utilized by computer science fields especially data mining. In this field, a data structure can be designed in the form of tree. Covering is a widely used form of data structure in data mining and covering-based rough sets provide a systematic approach to this type of data. In this paper, we study the connectedness of graphs through covering-based rough sets a...
متن کاملCyclic orderings and cyclic arboricity of matroids
We derive a general result concerning cyclic orderings of the elements of a matroid. As corollaries we obtain two further results. The first corollary proves a conjecture of Gonçalves [7], stating that the circular arboricity of a matroid is equal to its fractional arboricity. This generalises a well-known result from Nash-Williams on covering graphs by spanning trees, and a result from Edmonds...
متن کاملCovering Directed Graphs by In-Trees
Given a directed graphD = (V,A) with a set of d specified vertices S = {s1, . . . , sd} ⊆ V and a function f : S → Z+ where Z+ denotes the set of non-negative integers, we consider the problem which asks whether there exist ∑d i=1 f(si) in-trees denoted by Ti,1, Ti,2, . . . , Ti,f(si) for every i = 1, . . . , d such that Ti,1, . . . , Ti,f(si) are rooted at si, each Ti,j spans vertices from whi...
متن کامل